Перевод: с английского на все языки

со всех языков на английский

treap tree

См. также в других словарях:

  • Treap — In computer science, a treap is a binary search tree that orders the nodes by adding a random priority attribute to a node, as well as a key. Citation | title=Introduction to Algorithms, Second Edition publisher=MIT Press and McGraw Hill |… …   Wikipedia

  • Treap — In der Informatik ist ein Treap (Binary search Tree + Heap, wörtlich Haufen), auch Baufen, ein binärer Suchbaum. Jeder Knoten x besteht aus zwei Elementen: x.key (Element) x.priority (Priorität) Treaps wurden im Jahr 1996 von Cecilia R. Aragon… …   Deutsch Wikipedia

  • Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… …   Wikipedia

  • Tree rotation — A tree rotation is an operation on a binary search tree that changes the structure without interfering with the order of the elements. A tree rotation moves one node up in the tree and one node down. They are used to change the shape of the tree …   Wikipedia

  • Treap — En informatique, un treap est un arbre binaire de recherche qui ordonne les données en utilisant une priorité en plus de la clé propre à l arbre de recherche. Les données sont organisées de manière à ce que les clés forment un arbre binaire de… …   Wikipédia en Français

  • Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… …   Wikipedia

  • Randomized binary search tree — A randomized binary search tree (abbreviated RBST, also known as Cartesian tree) is a type of binary search tree, with data nodes organizedas in a normal binary search tree. Each node has also an access priority, namely p(n) which is chosen in a… …   Wikipedia

  • Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… …   Wikipedia

  • Radix tree — In computer science, a radix tree (also patricia trie or radix trie) is a space optimized trie data structure where each node with only one child is merged with its child. The result is that every internal node has at least two children. Unlike… …   Wikipedia

  • Dancing tree — For the film Dancing tree, see Dancing tree (film) In computer science, a dancing tree is a tree data structure, which is similar to B+ tree. Invented by Hans Reiser, for use by the Reiser4 file system. As opposed to self balancing binary search… …   Wikipedia

  • Hash tree — A binary hash tree In cryptography and computer science Hash trees or Merkle trees are a type of data structure[citation needed] which contains a tree of summary information about a larger piece of da …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»